Efficient Shortest Paths on Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, USA {xiaohanzhao, alessandra, htzheng, rav

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Edsger W. Dijkstra
• Network analysis
• Routing algorithms
• Centrality
• Shortest path problem
• Planar graph
• Pathfinding
• Social network analysis

Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin

Source URL: se.inf.ethz.ch

• Concurrency
• Deadlock
• Edsger W. Dijkstra
• Lock

PrefixSolve: Efficiently Solving Multi-Source Multi-Destination Path Queries on RDF Graphs by Sharing Suffix Computations Sidan Gao Kemafor Anyanwu

Source URL: www2013.wwwconference.org

• Network theory
• Mathematics
• Edsger W. Dijkstra
• Shortest path problem

Rome: Performance and Anonymity using Route Meshes Krishna P. N. Puttaswamy, Alessandra Sala, Omer Egecioglu, and Ben Y. Zhao Computer Science Department, University of California at Santa Barbara {krishnap, alessandra,

Source URL: www.cs.ucsb.edu

• Computing
• Edsger W. Dijkstra
• Computer architecture
• Mathematics
• Telecommunications
• Network architecture
• Routing
• Mesh networking
• Overlay network
• Shortest path problem
• Onion routing
• Crowds

Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao Department of Computer Science, UC Santa Barbara, USA {xiaohanzhao, alessandra, bowlin,

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Networks
• Network analysis
• Edsger W. Dijkstra
• Centrality
• Small-world network
• Shortest path problem
• Graph
• Breadth-first search

Bolt: On-Demand Infinite Loop Escape in Unmodified Binaries Michael Kling Sasa Misailovic

Source URL: people.csail.mit.edu

• Software engineering
• Computer programming
• Computing
• Recursion
• Edsger W. Dijkstra
• Programming paradigms
• Theoretical computer science
• Infinite loop
• Control flow
• Optimizing compiler
• For loop
• Bolt

Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software Vasco T. Vasconcelos Nobuko Yoshida

Source URL: places08.di.fc.ul.pt

• Concurrent programming languages
• Edsger W. Dijkstra
• Parallel computing
• Distributed computing
• Concurrent computing
• Programming language
• Go
• Type system
• Modularity
• Concurrency
• Limbo

1 PASS: A Parallel Activity Search System Andrea Pugliese, V.S. Subrahmanian, Christopher Thomas, and Cristian Molinaro Abstract—Given a set A of activities expressed via temporal stochastic automata, and a set O of o

Source URL: www.cs.umd.edu

• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming

The 2014 Edsger W. Dijkstra Prize in Distributed Computing The Dijkstra Prize Committee has selected Kanianthra Mani Chandy and Leslie Lamport as the recipients of this year’s Edsger W. Dijkstra Prize in Distributed Co

Source URL: www.disc-conference.org